On Projection Algorithms for Solving Convex Feasibility Problems
نویسندگان
چکیده
منابع مشابه
On Projection Algorithms for Solving Convex Feasibility Problems
Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of these algorithms, a very broad and exible framework is investigated. Several crucial new concepts wh...
متن کاملDistributed Algorithms for Solving a Class of Convex Feasibility Problems
In this paper, a class of convex feasibility problems (CFPs) are studied for multi-agent systems through local interactions. The objective is to search a feasible solution to the convex inequalities with some set constraints in a distributed manner. The distributed control algorithms, involving subgradient and projection, are proposed for both continuousand discrete-time systems, respectively. ...
متن کاملHow good are projection methods for convex feasibility problems?
We consider simple projection methods for solving convex feasibility problems. Both successive and sequential methods are considered, and heuristics to improve these are suggested. Unfortunately, particularly given the large literature which might make one think otherwise, numerical tests indicate that in general none of the variants considered are especially effective or competitive with more ...
متن کاملConvergence rate analysis and error bounds for projection algorithms in convex feasibility problems
Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems Amir Beck & Marc Teboulle To cite this article: Amir Beck & Marc Teboulle (2003) Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems, Optimization Methods and Software, 18:4, 377-394, DOI: 10.1080/10556780310001604977 To link to this article: http:/...
متن کاملA finite steps algorithm for solving convex feasibility problems
This paper develops an approach for solving convex feasibility problems where the constraints are given by the intersection of two convex cones in a Hilbert space. An extension to the feasibility problem for the intersection of two convex sets is presented as well. It is shown that one can solve such problems in a finite number of steps and an explicit upper bound for the required number of ste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 1996
ISSN: 0036-1445,1095-7200
DOI: 10.1137/s0036144593251710